Topological parameters for time-space tradeoff
نویسندگان
چکیده
منابع مشابه
Topological parameters for time-space tradeoff
In this paper we propose a family of algorithms combining treeclustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and deterministic networks as well as for accomplishing optimization tasks. By analyzing the problem structure the user can select from a spectrum of algorithms, the one that best meets a given time-space specification. T...
متن کاملTopological Parameters for Time-space Tradeoo
In this paper we propose a family of algorithms combining tree-clustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilis-tic and deterministic networks as well as for accomplishing optimization tasks. By analyzing the problem structure it will be possible to select from a spectrum the algorithm that best meets a given time-space speciica-tion.
متن کاملTopological Parameters for time-space tradeo
In this paper we propose a family of algorithms combining tree-clustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and deterministic networks as well as for accomplishing optimization tasks. By analyzing the problem structure it will be possible to select from a spectrum the algorithm that best meets a given time-space speci cation.
متن کاملA Time-Space Tradeoff for Element Distinctness
In a time-space tradeoff for sorting on non-oblivious machines, Borodin et. Al. [J. Comput. System Sci., 22(1981), pp. 351-364] proved that to sort $n$ elements requires $TS=\Omega(n^2)$ where $T=time$ and $S=space$ on a comparison based branching program. Although element distinctness and sorting are equivalent problems on a computation tree, the stated tradeoff result does not immediately fol...
متن کاملOptimal Time-Space Tradeoff in Probabilistic Inference
Recursive Conditioning, RC, is an any-space algorithm lor exact inference in Bayesian networks, which can trade space for time in increments of the size of a floating point number. This smooth tradeoff' is possible by varying the algorithm's cache size. When RC is run with a constrained cache size, an important problem arises: Which specific results should be cached in order to minimize the run...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2001
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(00)00050-3